Efficient query processing with associated horizontal class partitioning in an object relational data warehousing environment
نویسندگان
چکیده
In an Object Relational Data Warehousing (ORDW) environment, the semantics of data and queries can be explicitly captured, represented, and utilized based on is-a and class composition hierarchies, thereby resulting in more efficient OLAP query processing. In this paper, we show the efficacy in building semantic-rich hybrid class partitions by incorporating the Associated Horizontal Class Partitioning (AHCP) technique on the ORDW schema. Given a set of queries, we use primary and derived partitioning algorithms to select (near) optimal AHCPs, thereby embedding query semantics into the partitioned framework. Finally, by a cost model, we analyze the effectiveness of our approach visa-vis the unpartitioned approach.
منابع مشابه
Semantic Query Optimization based on Class Partitioning Techniques in an Object Relational Data Warehousing Environment*
The conventional star schema model of Data Warehouse (DW) has its limitations due to the nature of the relational data model. Firstly, this model cannot represent the semantics and operations of multi-dimensional data adequately. Due to the hidden semantics, it is difficult to efficiently address the problems of view design. Secondly, as we move up to higher levels of summary data (multiple com...
متن کاملEfficient query processing with structural join indexing in an object relational data warehousing environment
In an Object Relational Data Warehousing (ORDW) environment, the semantics of data and queries can be explicitly captured, represented, and utilized based on is-a and class composition hierarchies, thereby resulting in more efficient OLAP query processing. In this chapter, we show the efficacy in building semantic-rich hybrid data indexes incorporating Structural Join Index Hierarchy (SJIH) on ...
متن کاملHorizontal Class Partitioning for Queries in Object-Oriented Databases
Horizontal partitioning is a technique for reducing the number of disk accesses to execute a query by minimizing the number of irrelevant instances accessed. In this paper, we develop a cost model for query execution in the case of unpartitioned and horizontally partitioned classes. We present three algorithms to perform horizontal partitioning in OODBSs, namely: Cost-Driven Algorithm(CDA), Pre...
متن کاملQuery-Driven Horizontal Class Partitioning for Object-Oriented Databases
Horizontal partitioning (HP) technique is a logical database design technique rst developed for distributed relational (record struc-tured) databases. Though the main objective of HP is to reduce irrelevant data access, there has been very little work done in quantifying this by means of a cost model, and developing algorithms which derive the horizontal partitioning schemes. In this paper, we ...
متن کاملQuery optimization using horizontal class partitioning in object oriented databases
Query processing remains one of the most important challenges of object oriented database systems (OODBSs). A cost model for query processing is very useful in performing the physical query optimization. Horizontal class partitioning (HCP) is a technique for reducing the number of disk accesses for executing a given set of queries by minimizing the number of irrelevant object instances accessed...
متن کامل